By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 14, Issue 3, pp. 283-431

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Construction of Ferrero Pairs of All Possible Orders

Tim Boykett

pp. 283-285

BibTeX  Abstract Full Text:  PDF

Monochromatic Partitions of Complete Uniform Hypergraphs

Krzysztof Brys and Zbigniew Lonc

pp. 286-290

BibTeX  Abstract Full Text:  PDF

An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting

Young-Soo Myung

pp. 291-298

BibTeX  Abstract Full Text:  PDF

On Lower Bounds for Selecting the Median

Dorit Dor, Johan Håstad, Staffan Ulfberg, and Uri Zwick

pp. 299-311

BibTeX  Abstract Full Text:  PDF

Median Selection Requires $(2+\epsilon)n$ Comparisons

Dorit Dor and Uri Zwick

pp. 312-325

BibTeX  Abstract Full Text:  PDF

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

Thomas Erlebach and Klaus Jansen

pp. 326-355

BibTeX  Abstract Full Text:  PDF

Partitions and (m and n) Sums of Products---Two Cell Partition

Gregory L. Smith

pp. 356-369

BibTeX  Abstract Full Text:  PDF

Minimum Span of No-Hole (r+1)-Distant Colorings

Gerard J. Chang, Justie Su-tzu Juan, and Daphne Der-Fen Liu

pp. 370-380

BibTeX  Abstract Full Text:  PDF

Transformations on Regular Nondominated Coteries and Their Applications

Kazuhisa Makino and Tiko Kameda

pp. 381-407

BibTeX  Abstract Full Text:  PDF

On Approximating the Achromatic Number

Guy Kortsarz and Robert Krauthgamer

pp. 408-422

BibTeX  Abstract Full Text:  PDF

A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents

Alexander Barg, Gérard Cohen, Sylvia Encheva, Gregory Kabatiansky, and Gilles Zémor

pp. 423-431

BibTeX  Abstract Full Text:  PDF